Clique graphs and overlapping communities

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clique Graphs and Overlapping Communities

It is shown how to construct a clique graph in which properties of cliques of a fixed order in a given graph are represented by vertices in a weighted graph. Various definitions and motivations for these weights are given. The detection of communities or clusters is used to illustrate how a clique graph may be exploited. In particular a benchmark network is shown where clique graphs find the ov...

متن کامل

Line graphs, link partitions, and overlapping communities.

In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm that produces a partition of nodes can be used to produce a partit...

متن کامل

Clique Graphs and Edge-clique graphs

Not every edge-clique graph is a clique graph.

متن کامل

Approximating Sparse Graphs: The Random Overlapping Communities Model

How can we approximate sparse graphs and sequences of sparse graphs (with average degree unbounded and o(n))? We consider convergence in the first k moments of the graph spectrum (equivalent to the numbers of closed k-walks) appropriately normalized. We introduce a simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence...

متن کامل

Random Overlapping Communities: Approximating Motif Densities of Large Graphs

A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs capture power law degree distributions (BarabásiAlbert) and small-world properties (Watts-Strogatz), but only limited clustering behavior. We introduce a general...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2010

ISSN: 1742-5468

DOI: 10.1088/1742-5468/2010/12/p12037